Geometric Data Fitting
نویسنده
چکیده
Given a dense set of points lying on or near an embedded submanifold M0 ⊂ Rn of Euclidean space, the manifold fitting problem is to find an embedding F :M → Rn that approximatesM0 in the sense of least squares. When the dataset is modeled by a probability distribution, the fitting problem reduces to that of finding an embedding that minimizes Ed[F], the expected square of the distance from a point in Rn to F(M). It is shown that this approach to the fitting problem is guaranteed to fail because the functional Ed has no local minima. This problem is addressed by adding a small multiple k of the harmonic energy functional to the expected square of the distance. Techniques from the calculus of variations are then used to study this modified functional.
منابع مشابه
Fitting of Species Frequency Distribution Models in Woody Societies in Rangelands of Gouradarah, Gechigiran Ahar
One of the important goals of natural resource management is to conserve plant diversity in the ecosystem so that sites are more productive and more ecologically stable at the various situations. Different diversity indices have been presented to study the species status of natural ecosystems. One of these indicators is the use of empirical distribution models that each of these models ind...
متن کاملSurvey on Geometric Iterative Methods with Applications
Geometric iterative method, also called progressive-iterative approximation (PIA), is an iterative method with clear geometric meaning. Just by adjusting the control points of curves or surfaces iteratively, the limit curve or surface will interpolate (approximate) the given data point set. In this paper, we introduce the geometric iterative method in two aspects, i.e., theory and application. ...
متن کاملA Revisit to Least Squares Orthogonal Distance Fitting of Parametric Curves and Surfaces
Fitting of data points by parametric curves and surfaces is demanded in many scientific fields. In this paper we review and analyze existing least squares orthogonal distance fitting techniques in a general numerical optimization framework. Two new geometric variant methods (GTDM and CDM) are proposed. The geometric meanings of existing and modified optimization methods are also revealed.
متن کاملA New Approach to Geometric Fitting
Geometric fitting — parameter estimation for data subject to implicit parametric constraints — is a very common sub-problem in computer vision, used for curve, surface and 3D model fitting, matching constraint estimation and 3D reconstruction under constraints. Although many algorithms exist for specific cases, the general problem is by no means ‘solved’ and has recently become a subject of con...
متن کاملError analysis for piecewise quadratic curve fitting algorithms
We analyze the convergence of piecewise quadratic curve fitting algorithms which preserve geometric properties of the data such as monotonicity and convexity. In the process, we suggest two new algorithms which improve the order of convergence of existing algorithms.
متن کاملPartial Procedural Geometric Model Fitting for Point Clouds
Geometric model fitting is a fundamental task in computer graphics and computer vision. However, most geometric model fitting methods are unable to fit an arbitrary geometric model (e.g. a surface with holes) to incomplete data, due to that the similarity metrics used in these methods are unable to measure the rigid partial similarity between arbitrary models. This paper hence proposes a novel ...
متن کامل